Rademacher Complexity
نویسندگان
چکیده
Rademacher complexity is a measure of the richness of a class of real-valued functions. In this sense, it is similar to the VC dimension. In fact, we will establish a uniform deviation bound in terms of Rademacher complexity, and then use this result to prove the VC inequality. Unlike VC dimension, however, Rademacher complexity is not restricted to binary functions, and will also prove useful later in the analysis of other learning algorithms such as kernel-based algorithms.
منابع مشابه
Human Rademacher Complexity
We propose to use Rademacher complexity, originally developed in computational learning theory, as a measure of human learning capacity. Rademacher complexity measures a learner’s ability to fit random labels, and can be used to bound the learner’s true error based on the observed training sample error. We first review the definition of Rademacher complexity and its generalization bound. We the...
متن کاملLecture 6: Rademacher Complexity
In this lecture, we discuss Rademacher complexity, which is a different (and often better) way to obtain generalization bounds for learning hypothesis classes.
متن کاملRademacher Complexity Margin Bounds for Learning with a Large Number of Classes
This paper presents improved Rademacher complexity margin bounds that scale linearly with the number of classes as opposed to the quadratic dependence of existing Rademacher complexity margin-based learning guarantees. We further use this result to prove a novel generalization bound for multi-class classifier ensembles that depends only on the Rademacher complexity of the hypothesis classes to ...
متن کاملRademacher Complexity Bounds for Non-I.I.D. Processes
This paper presents the first Rademacher complexity-based error bounds for noni.i.d. settings, a generalization of similar existing bounds derived for the i.i.d. case. Our bounds hold in the scenario of dependent samples generated by a stationary β-mixing process, which is commonly adopted in many previous studies of noni.i.d. settings. They benefit from the crucial advantages of Rademacher com...
متن کاملLocal Rademacher complexity bounds based on covering numbers
This paper provides a general result on controlling local Rademacher complexities, which captures in an elegant form to relate the complexities with constraint on the expected norm to the corresponding ones with constraint on the empirical norm. This result is convenient to apply in real applications and could yield refined local Rademacher complexity bounds for function classes satisfying gene...
متن کامل